Mining definitions in Kissat with Kittens

Abstract Bounded variable elimination is one of the most important preprocessing techniques in SAT solving. It benefits from discovering functional dependencies form definitions encoded CNF. While common approach pioneered SatELite relies on syntactic pattern matching, our new uses cores produced by an embedded solver, Kitten . In contrast to a similar semantic technique implemented Lingeling based BDD algorithms generate irredundant CNFs, able DRAT proofs. We further discuss design choices for solver Kitten. Experiments with Kissat show effectiveness this approach.